The basic feasible functionals in computable analysis
نویسنده
چکیده
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one considers the application of Melhorn’s class of the Basic Feasible Functionals to computable analysis. We show that both notions define the same set of real numbers and functions.
منابع مشابه
A Construction of Typed Lambda Models Related to Feasible Computability
In this paper we develop an approach to the notion of computable functionals in a very abstract setting not restricted to Turing or, say, polynomial computability. We assume to start from some basic class of domains and a basic class of functions deened on these domains. (An example may be natural numbers with polytime computable functions). Then we deene what are \all" corresponding functional...
متن کاملA proof-theoretic characterization of the basic feasible functionals
We provide a natural characterization of the type two Mehlhorn-CookUrquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in [30], thus providing a proof of a result claimed in the conclusion of [30]. This further characterization of the basic feasible functionals underpins their importance as a key candidate for the no...
متن کاملFeasible functionals and intersection of ramified types
We show that the basic feasible functions of Cook and Urquhart’s BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type intersection (for tier-variants of a common type). This further confirms the stability of BFF as a notion of computational feasibility in higher type. It also suggests the potential usefulness of type-intersection restricted...
متن کاملSeparating Notions of Higher-Type Polynomial-Time
In his paper on machine characterizations of feasible functionals at all simple types, Seth [Set95] introduced the higher-type complexity class D and conjectured that this class is strictly larger than BFF, the basic feasible functionals of Cook and Urquhart [CU93]. In this paper we clarify the nature of D by characterizing D−, a subclass of D, through a typed programming formalism and show D− ...
متن کاملCharacterizing polynomial time complexity of stream programs using interpretations
This paper provides a criterion based on interpretation methods on term rewrite systems in order to characterize the polynomial time complexity of second order functionals. For that purpose it introduces a first order functional stream language that allows the programmer to implement second order functionals. This characterization is extended through the use of exp-poly interpretations as an at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Complexity
دوره 22 شماره
صفحات -
تاریخ انتشار 2006